|
In a communication network, sometimes a max-min fairness of the network is desired, usually opposed to the basic first-come first-served policy. With max-min fairness, data flow between any two nodes is maximized, but only at the cost of ''more or equally expensive'' data flows. To put it another way, in case of network congestion any data flow is only impacted by smaller or equal flows. In such context, a bottleneck link for a given data flow is a link that is fully utilized (is ''saturated'') and of all the flows sharing this link, the given data flow achieves maximum data rate network-wide.〔(Jean-Yves Le Boudec (EPFL Lausanne) "Rate adaptation, Congestion Control and Fairness: A Tutorial" Nov 2005 )〕 Note that this definition is substantially different from a common meaning of a ''bottleneck''. Also note, that this definition does not forbid a single link to be a bottleneck for multiple flows. A data rate allocation is max-min fair if and only if a data flow between any two nodes has at least one bottleneck link. ==See also== * Fairness measure * Max-min fairness 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bottleneck (network)」の詳細全文を読む スポンサード リンク
|